By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
What Article options are available ?   View Cart   

Sorting in Average Time $o(\log \,n)$

M. Ajtai, D. Karabeg, J. Komlós, and E. Szemerédi

pp. 285-292

BibTeX  Abstract Full Text:  PDF

Leaf Pairs and Tree Dissections

Stephen F. Altschul

pp. 293-299

BibTeX  Abstract Full Text:  PDF

On the Invertibility of the Discrete Radon Transform

Gregory M. Constantine

pp. 300-306

BibTeX  Abstract Full Text:  PDF

Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles

D. S. Franzblau

pp. 307-321

BibTeX  Abstract Full Text:  PDF

Constructing a Maximal Independent Set in Parallel

Mark Goldberg and Thomas Spencer

pp. 322-328

BibTeX  Abstract Full Text:  PDF

Single-Suit Two-Person Card Play III. The Misère Game

J. Kahn, J. C. Lagarias, and H. S. Witsenhausen

pp. 329-343

BibTeX  Abstract Full Text:  PDF

Divisors without Unit-Congruent Ratios

D. J. Kleitman

pp. 344-349

BibTeX  Abstract Full Text:  PDF

Perturbations of Shifts of Finite Type

D. A. Lind

pp. 350-365

BibTeX  Abstract Full Text:  PDF

Identities Satisfied by Iterated Polynomials and $(Q,x)$-Binomial Coefficients

C. L. Mallows

pp. 366-370

BibTeX  Abstract Full Text:  PDF

Perfect Graphs and Orthogonally Convex Covers

Rajeev Motwani, Arvind Raghunathan, and Huzur Saran

pp. 371-392

BibTeX  Abstract Full Text:  PDF

Random Sequential Adsorption on Graphs

Nicholas Pippenger

pp. 393-401

BibTeX  Abstract Full Text:  PDF

A Ramsey-Type Theorem for Orderings of a Graph

Vojtech Rödl and Peter Winkler

pp. 402-406

BibTeX  Abstract Full Text:  PDF

Node-Packing Problems with Integer Rounding Properties

S. K. Tipnis and L. E. Trotter, Jr.

pp. 407-412

BibTeX  Abstract Full Text:  PDF

Gaussian Elimination with Pivoting is P-Complete

Stephen A. Vavasis

pp. 413-423

BibTeX  Abstract Full Text:  PDF